MATH5248: Cryptology and Number Theory

4 Credits

Classical cryptosystems. One-time pads, perfect secrecy. Public key ciphers: RSA, discrete log. Euclidean algorithm, finite fields, quadratic reciprocity. Message digest, hash functions. Protocols: key exchange, secret sharing, zero-knowledge proofs. Probablistic algorithms: pseudoprimes, prime factorization. Pseudo-random numbers. Elliptic curves. prereq: 2 sems soph math

View on University Catalog

All Instructors

B+ Average (3.358)Most Common: A (39%)

This total also includes data from semesters with unknown instructors.

1303 students
SNWFDCBA

  • 4.96

    /6

    Recommend

  • 5.05

    /6

    Effort

  • 5.32

    /6

    Understanding

  • 4.91

    /6

    Interesting

  • 5.03

    /6

    Activities
      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2025 provided by the University in response to a public records request

      Not affiliated with the University of Minnesota

      Privacy Policy